Sequent calculus and data fusion

نویسندگان

  • Claudio Sossai
  • Paolo Bison
  • Gaetano Chemello
چکیده

We present a formal method for data fusion, based on possibilistic logic. The method has been applied to a real-world problem of noisy sensor-data fusion: the position estimation of an autonomous mobile robot navigating in an approximately and partially known office environment using a topological map. Each place in the map is characterized by a set of logical formulae axiomatizing both symbolic knowledge and uncertain information from the sensors. At each time instant during navigation, the necessity for each place is calculated using a function generated by a proof system based on sequent calculus. Several test runs using a real robot have shown the adequacy of the approach in interpreting and disambiguating the information coming from independent perceptual sources, in combination with symbolic knowledge.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fusion of sequent modal logic systems labelled with truth values

Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calculi labelled with truth values and with a semantics based on a two-sorted algebra allowing, in particular, the representation of general Kripke structures. A wide variety of logics, including non-classical logics like,...

متن کامل

Initial investigations into relating Logical and Computational Calculi

2 Natural Deduction and Sequent Calculus 1 2.1 Natural Deduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2.2 Sequent Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.3 Proofs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

متن کامل

Focused Linear Logic and the λ-calculus

Linear logic enjoys strong symmetries inherited from classical logic while providing a constructive framework comparable to intuitionistic logic. However, the computational interpretation of sequent calculus presentations of linear logic remains problematic, mostly because of the many rule permutations allowed in the sequent calculus. We address this problem by providing a simple interpretation...

متن کامل

Duality of computation and sequent calculus: a few more remarks

A succession of works have contributed to the understanding of the computational content of Gentzen-style classical sequent calculus. Especially, it has been shown that the left-right duality of sequent calculus expresses a syntactic duality between programs and their evaluation contexts and that sequent calculus has two dual syntactic restrictions that respectively correspond to callby-name ev...

متن کامل

Semantical Investigation of Simultaneous Skolemization for First-order Sequent Calculus Semantical Investigation of Simultaneous Skolemization for First-order Sequent Calculus

Simultaneous quantiier elimination in sequent calculus is an improvement over the well-known skolemization. It allows a lazy handling of instantiations as well as of the order of certain reductions. We prove the soundness of a sequent calculus which incorporates a rule for simultaneous quantiier elimination. The proof is performed by semantical arguments and provides some insights into the depe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Fuzzy Sets and Systems

دوره 121  شماره 

صفحات  -

تاریخ انتشار 2001